Infinitely Many Trees Have Non-Sperner Subtree Poset
نویسندگان
چکیده
Let C(T) denote the poset of subtrees of a tree T with respect to the inclusion ordering. Jacobson, Kézdy and Seif gave a single example of a tree T for which C(T) is not Sperner, answering a question posed by Penrice. The authors then ask whether there exist an infinite family of trees T such that C(T) is not Sperner. This paper provides such a family.
منابع مشابه
Nonhomogeneous analytic families of trees
We consider a dichotomy for analytic families of trees stating that either there is a colouring of the nodes for which all but finitely many levels of every tree are nonhomogeneous, or else the family contains an uncountable antichain. This dichotomy implies that every nontrivial Souslin poset satisfying the countable chain condition adds a splitting real. We then reduce the dichotomy to a conj...
متن کاملThe Structure of the Consecutive Pattern Poset
The consecutive pattern poset is the infinite partially ordered set of all permutations where σ ≤ τ if τ has a subsequence of adjacent entries in the same relative order as the entries of σ. We study the structure of the intervals in this poset from topological, poset-theoretic, and enumerative perspectives. In particular, we prove that all intervals are rank-unimodal and strongly Sperner, and ...
متن کاملThe Subtree Size Profile of Bucket Recursive Trees
Kazemi (2014) introduced a new version of bucket recursive trees as another generalization of recursive trees where buckets have variable capacities. In this paper, we get the $p$-th factorial moments of the random variable $S_{n,1}$ which counts the number of subtrees size-1 profile (leaves) and show a phase change of this random variable. These can be obtained by solving a first order partial...
متن کاملThe Sperner Property for Integer Partition Posets
We examine the integer partition poset, Pn, ordered by a covering relation to determine whether or not it has the Sperner property. To show that Pn is Sperner we must prove it satisfies unimodality and the bipartite matching property. It has been shown computationally by Canfield for n ≤ 2000 and asymptotically by Szekeres for n sufficiently large that Pn is unimodal. Computationally, we have i...
متن کاملOn the structure of maximum 2-part Sperner families
Color the elements of a finite set S with two colors. A collection of subsets of S is called a 2-part Sperner family if whenever for two distinct sets A and B in this collection we have A ⊂ B then B − A has elements of S of both colors. All 2-part Sperner families of maximum size were characterized in Erdös and Katona [5]. In this paper we provide a different, and quite elementary proof of the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Order
دوره 24 شماره
صفحات -
تاریخ انتشار 2007